Bounded Flooding Routing Algorithm for Provisioning the Globally Optimal Route in a Hierarchical ATM Network

نویسندگان

  • Daniel Won-Kyu Hong
  • Choong Seon Hong
  • Dong-Sik Yun
  • Jae-Hyoung Yoo
  • Woo-Sung Kim
چکیده

ATM virtual path (VP) contains bundles of virtual channels (VCs). A VP layer network can be used as a server layer network of VC layer networks and each VC layer network can be a client layer. Therefore the effective provision of VC services can be achieved by a better routing scheme of the VP layer network. However, the traditional hierarchical routing scheme of PNNI signaling protocol does not provide the globally optimal route in hierarchical transport network due to its successive network partitioning and topology abstraction. We propose a new VP routing scheme suitable for a nation-wide hierarchical transport network and a network model suitable for the scalable VP network management system. The routing algorithm can provide the globally optimal route in the hierarchical network environment from the perspectives of maximization of network resource utilization and satisfaction of the end user’s QoS requirement. In addition, we describe the implementation model of the ATM virtual path network management system (VP-NMS). Lastly, we show the routing performance evaluated in the High Speed Information Network (HSIN) of Korea Telecom.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Method to Reduce Energy Consumption in Manet Network Routing based on OLSR Protocol and Genetic Algorithm

Mobile Ad Hoc Networks (MANET) can be considered as a class of unstructured networks created by a number of autonomous wireless and sensor nodes. The inherent characteristics of such networks have made specific applications, such as multimedia transfer and challenging. Basically, the functionality of a node and very few resources directly affect the delivery of packets which depends on the ...

متن کامل

A New Method to Reduce Energy Consumption in Manet Network Routing based on OLSR Protocol and Genetic Algorithm

Mobile Ad Hoc Networks (MANET) can be considered as a class of unstructured networks created by a number of autonomous wireless and sensor nodes. The inherent characteristics of such networks have made specific applications, such as multimedia transfer and challenging. Basically, the functionality of a node and very few resources directly affect the delivery of packets which depends on the ...

متن کامل

A Hierarchical LSP Management Architecture for MPLS Traffic Engineering

In this paper, we propose a scalable Label Switched Path (LSP) management architecture for Multiprotocol Label Switching (MPLS) traffic engineering using a hierarchical network model. MPLS introduces the concept of a label hierarchy to support scalability by lessening the complexity of transit routers for the computation of complete routing tables. However, this hierarchical network model creat...

متن کامل

A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

متن کامل

Flood Routing Technique for Data Networks

In this paper, a new routing algorithm based on a flooding method is introduced. Flooding techniques have been used previously, e.g. for broadcasting the routing table in the ARPAnet [1] and other special purpose networks [3][4][5]. However, sending data using flooding can often saturate the network [2] and it is usually regarded as an inefficient broadcast mechanism. Our approach is to flood a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. UCS

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2002